Abstraction of Arrays Based on Non Contiguous Partitions
نویسندگان
چکیده
ion of Arrays Based on Non Contiguous Partitions Jiangchao Liu, Xavier Rival To cite this version: Jiangchao Liu, Xavier Rival. Abstraction of Arrays Based on Non Contiguous Partitions. 15th Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2015, Mumbai, India. Springer, pp.282 299, 2015, Proceedings of the 15th Conference on Verification, Model Checking, and Abstract Interpretation. <10.1007/978-3-662-46081-8 16>. HAL Id: hal-01095985 https://hal.archives-ouvertes.fr/hal-01095985 Submitted on 16 Dec 2014 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Abstraction of Arrays Based on Non Contiguous Partitions ⋆ion of Arrays Based on Non Contiguous Partitions ⋆ Jiangchao Liu and Xavier Rival INRIA, ENS, CNRS, Paris, France, [email protected], [email protected] Abstract. Array partitioning analyses split arrays into contiguous partitions to infer properties of cell sets. Such analyses cannot group together non contiguous cells, even when they have similar properties. In this paper, we propose an abstract domain which utilizes semantic properties to split array cells into groups. Cells with similar properties will be packed into groups and abstracted together. Additionally, groups are not necessarily contiguous. This abstract domain allows to infer complex array invariants in a fully automatic way. Experiments on examples from the Minix 1.1 memory management demonstrate its effectiveness. Array partitioning analyses split arrays into contiguous partitions to infer properties of cell sets. Such analyses cannot group together non contiguous cells, even when they have similar properties. In this paper, we propose an abstract domain which utilizes semantic properties to split array cells into groups. Cells with similar properties will be packed into groups and abstracted together. Additionally, groups are not necessarily contiguous. This abstract domain allows to infer complex array invariants in a fully automatic way. Experiments on examples from the Minix 1.1 memory management demonstrate its effectiveness.
منابع مشابه
An array content static analysis based on non-contiguous partitions
Conventional array partitioning analyses split arrays into contiguous partitions to infer properties of sets of cells. Such analyses cannot group together non contiguous cells, even when they have similar properties. In this paper, we propose an abstract domain which utilizes semantic properties to split array cells into groups. Cells with similar properties will be packed into groups and abstr...
متن کاملAnalyzing the Performance of Allocation Strategies Based on Space-Filling Curves
Future exascale supercomputers will be composed of thousands of nodes. In those massive systems, the search for physically close nodes will become essential to deliver an optimal environment to execute parallel applications. Schedulers manage those resources, shared by many users and jobs, searching for partitions in which jobs will run. Significant effort has been devoted to develop allocation...
متن کاملSymbolic Execution and Model Checking for Testing
Subsumption • Symbolic execution with subsumption checking – Not enough to ensure termination – An infinite number of symbolic states • Our solution – Abstraction • Store abstract versions of explored symbolic states • Subsumption checking to determine if an abstract state is re-visited • Decide if the search should continue or backtrack – Enables analysis of under-approximation of program beha...
متن کاملProcessor Management in Two-Dimensional Grid-Architectures
This article considers the problem of allocating parallel programs to processor partitions of multicomputers with a two-dimensional grid interconnection network. We assume the dynamic multiprogramming case, where arriving programs request partitions net which are released after program termination. Because those partitions should be compact to achieve low communication overhead during execution...
متن کاملFluid Updates: Beyond Strong vs. Weak Updates
We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that relaxes the dichotomy between strong and weak updates. Our technique is fully automatic, does not suffer from the kind of state-space explosion problem partition-based approaches are prone to, and can naturally express properties t...
متن کامل